ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
نویسندگان
چکیده
In the present paper, we classify abelian antipodal distance-regular graphs \(\Gamma\) of diameter 3 with following property: \((*)\) has a transitive group automorphisms \(\widetilde{G}\) that induces primitive almost simple permutation \(\widetilde{G}^{\Sigma}\) on set \({\Sigma}\) its classes. There are several infinite families (arc-transitive) examples in case when rank \({\rm rk}(\widetilde{G}^{\Sigma})\) equals 2 moreover, all such now known. Here focus rk}(\widetilde{G}^{\Sigma})=3\).Under this condition socle turns out to be either sporadic group, or an alternating exceptional Lie type, classical group. Earlier, it was shown family non-bipartite property \(rk(\widetilde{G}^{\Sigma})=3\) and is finite limited small number potential examples. The paper aimed study for \(\widetilde{G}^{\Sigma}\). We follow classification scheme based reduction minimal quotients inherit \((*)\). For each given degree \(|{\Sigma}|\le 2500\), determine \(\Gamma\), applying some previously developed techniques bounding their spectrum parameters combination groups corresponding type associated graphs. This allows us essentially restrict sets feasible under 2500.\)
منابع مشابه
Antipodal Distance Transitive Covers of Complete Graphs
This paper is a contribution towards the determination of all finite distance-transitive graphs. We obtain a classification of all the antipodal distance-transitive graphs having as antipodal quotient a complete graph Kn . Such a graph necessarily has diameter 2 or 3 (see for example [2, Proposition 4.2.2 (ii)]). Those of diameter 2 are simply the complete multipartite graphs Kr,...,r with n pa...
متن کاملDistance-Regular Graphs with bt=1 and Antipodal Double-Covers
Throughout this paper, we assume 1 is a connected finite undirected graph without loops or multiple edges. We identify 1 with the set of vertices. For vertices : and ; in 1, let (:, ;) denote the distance between : and ; in 1, that is, the length of a shortest path connecting : and ;. Let d=d(1 ) denote the diameter of 1, that is, the maximal distance between any two vertices in 1. Let 1i (:)=[...
متن کاملAntipodal covers of strongly regular graphs
Antipodal covers of strongly regular graphs which are not necessarily distance-regular are studied. The structure of short cycles in an antipodal cover is considered. In most cases, this provides a tool to determine if a strongly regular graph has an antipodal cover. In these cases, covers cannot be distance-regular except when they cover a complete bipartite graph. A relationship between antip...
متن کاملSome Notes on Distance-Transitive and Distance-Regular Graphs
These are notes from lectures given in the Queen Mary Combinatorics Study 1 Introductory Definitions In these notes, Γ = (V Γ, EΓ) denotes a graph, as we will use G to denote a group. All graphs considered will be simple, finite, connected and undirected. Definition An automorphism of Γ is a bijective function g : V Γ → V Γ such that v ∼ w if and only if g(v) ∼ g(w). The set of all automorphism...
متن کاملLocally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs
In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are obtained that apply to arbitrary covering transformation groups. In particular, methods are obtained for classifying the locally 3-arctransitive graphs with a prescribed covering transformation group, and these results are applied to classify the locally 3-arc-transitive regular cove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ural mathematical journal
سال: 2022
ISSN: ['2414-3952']
DOI: https://doi.org/10.15826/umj.2022.2.014